COPLAS 2011 Proceedings of the Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems Freiburg , Germany
نویسندگان
چکیده
We study an unrelated parallel machines scheduling problem with sequence and machine dependent setup times. A logicbased Benders decomposition approach is proposed to minimize the makespan. The decomposition approach is a hybrid model that makes use of a mixed integer programming master problem and a travelling salesman problem subproblem. The master problem is a relaxation of the problem and is used to create assignments of jobs to machines, while the subproblem obtains optimal schedules based on the master problem assignments. Computational results comparing the Benders decomposition and mixed integer program formulation show that the Benders model is able to find optimal solutions to problems up to five orders of magnitude faster as well as solving problems four times the size possible previously.
منابع مشابه
Introduction to planning, scheduling and constraint satisfaction
Planning, scheduling and constraint satisfaction are important areas in Artificial Intelligence (AI). Many real-world problems are known as AI planning and scheduling problems, where resources must be allocated so as to optimize overall performance objectives. Therefore, solving these problems requires an adequate mixture of planning, scheduling and resource allocation to competing goal activit...
متن کاملCOPLAS 2010 Proceedings of the Workshop on Constraint Satisfaction
Introduction of explicit time and resources into planning that typically focuses on causal relations between actions is an important step towards modelling real-life problems. In this paper we propose a suboptimal domain-independent planning system Filuta that focuses on planning, where time plays a major role and resources are constrained. We benchmark Filuta on the planning problems from the ...
متن کاملKEPS�2011� Proceedings�of�the�Workshop�on�Knowledge� Engineering�for�Planning�and�Scheduling�� Freiburg,�Germany� June�12,�2011� Edited�by� Roman�Barták,�Simone�Fratini,� Lee�McCluskey,�Tiago�Stegun�Vaquero� � Organization
In this paper we present a brief overview of the Knowledge Engineering for Planning and Scheduling (KEPS) area in the light of a prospective design process of planning application models. The main discussion is based on the fact that KE is better introduced in the planning world through the design process, more than through the planning techniques. Thus, we examine the fundamental steps in the ...
متن کاملEdited By : Nicola Policella and Nilufer Onder Rome , Italy - June 12 , 2013
Post-optimization through local search is known to be a powerful approach for complex optimization problems. In this paper we tackle the problem of optimizing individual activity plans, i.e., plans that concern activities that one person has to accomplish independently of others, taking into account complex constraints and preferences. Recently, this problem has been addressed adequately using ...
متن کاملPreface to special issue on planning and scheduling
Planning, scheduling and constraint satisfaction are important areas in artificial intelligence (AI) with broad practical applicability. Many real-world problems can be formulated as AI planning and scheduling (P&S) problems, where resources must be allocated to optimize overall performance objectives. Frequently, solving these problems requires an adequate mixture of planning, scheduling and r...
متن کامل